An experimental study about the search mechanism in the SLAVE learning algorithm: Hill-climbing methods versus genetic algorithms

نویسندگان

  • Antonio González Muñoz
  • Raúl Pérez
چکیده

One of the basic elements in the development of the AI system is the search mechanism. The choice of the search method can determine the goodness of the developed system. In concrete, in the learning algorithms, the search mechanisms play a very important role. SLAVE is an inductive learning algorithm that describes the behavior of a system by a fuzzy rule set being a genetic algorithm of its search mechanism. In this work, we want to study the in¯uence of the search mechanism in the learning process of SLAVE. So, we analyze the results obtained with SLAVE using several search mechanisms based on hill-climbing techniques described in the literature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction

No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...

متن کامل

A Proposed Improved Hybrid Hill Climbing Algorithm with the Capability of Local Search for Solving the Nonlinear Economic Load Dispatch Problem

This paper introduces a new hybrid hill-climbing algorithm (HHC) for solving the Economic Dispatch (ED) problem. This algorithm solves the ED problems with a systematic search structure with a global search. It improves the results obtained from an evolutionary algorithm with local search and converges to the best possible solution that grabs the accuracy of the problem. The most important goal...

متن کامل

An Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning An Empirical Comparison of Hill-Climbing and Exhaustive Search in Inductive Rule Learning

Most commonly used inductive rule learning algorithms employ a hill-climbing search, whereas local pattern discovery algorithms employ exhaustive search. In this paper, we evaluate the spectrum of different search strategies to see whether separate-and-conquer rule learning algorithms are able to gain performance in terms of predictive accuracy or theory size by using more powerful search strat...

متن کامل

An Adaptive Strategy Applied to Memetic Algorithms

Memetic algorithms(MAs) represent one of the promising areas of evolutionary algorithms. However, there are many issues to be solved to design a robust MA. In this paper, we introduce an adaptive memetic algorithm, named GADEDHC, which combines a genetic algorithm and a differential evolution algorithm as global search methods with a directional hill climbing algorithm as local search method. I...

متن کامل

Optimization Methods: Advanced Topics in Optimization - Evolutionary Algorithms for Optimization and Search

Most real world optimization problems involve complexities like discrete, continuous or mixed variables, multiple conflicting objectives, non-linearity, discontinuity and non-convex region. The search space (design space) may be so large that global optimum cannot be found in a reasonable time. The existing linear or nonlinear methods may not be efficient or computationally inexpensive for solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 136  شماره 

صفحات  -

تاریخ انتشار 2001